Ramsey number

Definition

The Ramsey number $R(s,t)$ is the minimum number $n$ such that any graph on $n$ vertices contains either an independent set of size $s$ or a clique of size $t$.

References

1. https://math.mit.edu/~fox/MAT307-lecture05.pdf